منابع مشابه
The Enumerability of P Collapses P to NC
We show that one cannot rule out even a single possibility for the value of an arithmetic circuit on a given input using an NC algorithm, unless P collapses to NC (i.e., unless all problems with polynomial-time sequential solutions can be efficiently parallelized). In other words, excluding any possible solution in this case is as hard as actually finding the solution. The result is robust with...
متن کاملReducing P to a Sparse Set using a Constant Number of Queries Collapses P to L
We prove that there is no sparse hard set for P under logspace computable bounded truth-table reductions unless P = L. In case of reductions computable in NC 1 , the collapse goes down to P = NC 1. We generalize this result by parameterizing the sparseness condition, the space bound and the number of queries of the reduction, apply the proof technique to NL and L, and extend all these theorems ...
متن کاملEnumerative properties of NC ( B ) ( p , q )
We determine the rank generating function, the zeta polynomial and the Möbius function for the poset NC(p, q) of annular non-crossing partitions of type B, where p and q are two positive integers.
متن کاملEvery Polynomial-Time 1-Degree Collapses iff P=PSPACE
A set A is m-reducible (or Karp-reducible) to B i there is a polynomial-time computable function f such that, for all x, x 2 A () f(x) 2 B. Two sets are: 1-equivalent i each is m-reducible to the other by one-one reductions; p-invertible equivalent i each is m-reducible to the other by one-one, polynomial-time invertible reductions; and p-isomorphic i there is an m-reduction from one set to the...
متن کامل00 8 Enumerative properties of NC ( B ) ( p , q )
We determine the rank generating function, the zeta polynomial and the Möbius function for the poset NC(p, q) of annular non-crossing partitions of type B, where p and q are two positive integers. We give an alternative treatment of some of these results in the case q = 1, for which this poset is a lattice. We also consider the general case of multiannular non-crossing partitions of type B, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.07.010